On Computing the Size of a Lattice and Related Decision Problems
نویسنده
چکیده
The problem of determining the size of a finite concept lattice is shown to be #P-complete. Since any finite lattice can be represented as a concept lattice, the problem of determining the size of a lattice given by the ordered sets of its irreducibles is also #P-complete. Some results about NP-completeness or polynomial tractability of decision problems related to concepts with bounded extent, intent, and the sum of both are given. These problems can be reformulated as decision problems about lattice elements generated by a certain amount of irreducibles. Mathematics Subject Classification (2000): 03G10.
منابع مشابه
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملImplementation of D3Q19 Lattice Boltzmann Method with a Curved Wall Boundary Condition for Simulation of Practical Flow Problems
In this paper, implementation of an extended form of a no-slip wall boundary condition is presented for the three-dimensional (3-D) lattice Boltzmann method (LBM) for solving the incompressible fluid flows with complex geometries. The boundary condition is based on the off-lattice scheme with a polynomial interpolation which is used to reconstruct the curved or irregular wall boundary on the ne...
متن کاملSoft Computing Based on a Modified MCDM Approach under Intuitionistic Fuzzy Sets
The current study set to extend a new VIKOR method as a compromise ranking approach to solve multiple criteria decision-making (MCDM) problems through intuitionistic fuzzy analysis. Using compromise method in MCDM problems contributes to the selection of an alternative as close as possible to the positive ideal solution and far away from the negative ideal solution, concurrently. Using Atanasso...
متن کاملA Compromise Ratio Ranking Method of Triangular Intuitionistic Fuzzy Numbers\ and Its Application to MADM Problems
Triangular intuitionistic fuzzy numbers (TIFNs) is a special case of intuitionistic fuzzy (IF) set and the ranking of TIFNs is an important problem. The aim of this paper is to develop a new methodology for ranking TIFNs by using multiattribute decision making methods (MADM). In this methodology, the value and ambiguity indices of TIFNs may be considered as the attributes and the TIFNs in compa...
متن کاملSoft Computing-based New Interval-valued Pythagorean Triangular Fuzzy Multi-criteria Group Assessment Method without Aggregation: Application to a Transport Projects Appraisal
In this paper, an interval-valued Pythagorean triangular fuzzy number (IVPTFN) as a useful tool to handle decision-making problems with vague quantities is defined. Then, their operational laws are developed. By introducing a novel method of making a decision on the concept of possibility theory, a multi-attribute group decision-making (MAGDM) problem is considered, in which the attribute value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 18 شماره
صفحات -
تاریخ انتشار 2001